Method and apparatus for dynamic, seamless security in communication protocols

ABSTRACT

Communication nodes, acting as intermediate routers for communication packets transmitted between a source node and a destination node, are provided with different access rights to the fields of the routed communication packets. Routes of intermediate routers between the source node and the destination node are discovered and the identities of intermediate routers on the discovered routes are collected. The aggregate trust levels of the intermediate routers are computed allowing the most trusted route to be selected. Encryption keys are securely distributed to intermediate routers on the most trusted route based on the trust level of the intermediate routers and fields of the communication packets are encrypted with encryption keys corresponding to the assigned trust level. Intermediated nodes are thereby prevented from accessing selected fields of the communication packets.

BACKGROUND

Security and privacy represent important issues in modern communication over fixed or mobile wireless networks. The classical protocol of communication stack recommended by OSI is continuously changed to accommodate new routing techniques. For instance, routing can not only be implemented in the third (routing) layer of communication protocols but also in the second (link) layer, as proposed by Mesh Networks, or at upper layers (i.e. application layer), as proposed by peer-to-peer networks. By providing intermediate nodes access to data packets, network communication is inherently insecure. In seamless mobility scenarios, nodes can act in an ad-hoc manner as routers for packets sent by others. In certain scenarios, such nodes can even act as bridges between different networks. Such networks can have different access restrictions to the fields of the packets forwarded. Moreover, nodes acting as bridges might need rights to access more packet fields than regular routing nodes.

BRIEF DESCRIPTION OF THE DRAWINGS

The novel features believed characteristic of the invention are set forth in the appended claims. The invention itself, however, as well as the preferred mode of use, and further objects and advantages thereof, will best be understood by reference to the following detailed description of an illustrative embodiment when read in conjunction with the accompanying drawing(s), wherein:

FIG. 1 is a diagram of an exemplary communication packet consistent with certain embodiments of the invention.

FIG. 2 is a diagram illustrative of key distribution in a communication network consistent with certain embodiments of the invention.

FIG. 3 is a diagram illustrative of route discovery in a communication network consistent with certain embodiments of the invention.

FIG. 4 is a flow chart of a method for secure communication consistent with certain embodiments of the invention

DETAILED DESCRIPTION

While this invention is susceptible of embodiment in many different forms, there is shown in the drawings and will herein be described in detail one or more specific embodiments, with the understanding that the present disclosure is to be considered as exemplary of the principles of the invention and not intended to limit the invention to the specific embodiments shown and described. In the description below, like reference numerals are used to describe the same, similar or corresponding parts in the several views of the drawings.

The present invention relates to a protocol for data encryption for communication networks such that the intermediate nodes (known as routers) have limited but personalized access to data packets they handle. The protocol allows communicating parties to encrypt each field (header or payload) of the communication packets separately and to constrain their visibility, through the use of encryption, to intermediate nodes acting as routers. The access could be limited on a need-to-know basis or as part of a mechanism rewarding cooperation. For example, the protocol provides the communication end-points (the source destination nodes) with the ability to dynamically change the access rights, based on the behavior of intermediate routers. Misbehaving routers that drop or modify packets can cause the end-point devices to choose different routing routes or severely limit the access to the fields of the routed packets. Well-behaved routers may receive more credentials, in the shape of decryption keys, allowing them to access more fields of the routed packets. This feature is based on the assumption that routed packets contain information (payload, routing information, location information, the existence of a remotely accessible printer) that is useful to third parties.

This protocol not only allows different access patterns for different intermediate routers based on their trust level, but also allows setting different overall security levels, based on the application type. For instance, highly secure communications should hide as many headers as possible from the intermediate routers, while still permitting routing to take place. At the other end of the spectrum, applications with low security levels may use fewer or no encryption keys.

The protocol provides a systematic solution for network privacy and security using a hierarchical encryption of data packets. Each layer of communication adds or subtracts finite and fixed segments of the data frame called headers.

When data is routed from source to destination, based on the protocol type, the intermediate nodes need to access only a subset of the information contained in the data frame. In one embodiment, headers are encrypted in the data frame such that an intermediate node can access information based on the role it plays and its trust level. In addition, the node access rights may be changed dynamically based on history and communication needs.

FIG. 1 is a diagram of an exemplary communication packet consistent with certain aspects of the invention. In FIG. 1, communication packet 100 includes a data payload 102 and headers 104, 106, 108 and 110. The packet is encrypted with a multitude of hierarchical encryption keys.

Header 1, 104, is not encrypted, but Header 2, 106, is encrypted using encryption key K1. Header 3, 108 is encrypted using encryption key K12, which may be an independent key or a hierarchical key derived from K1. Similarly, Header 4, 110 is encrypted using encryption key K123, which may be an independent key or a hierarchical key derived from K12. The data payload 102 is encrypted using the key K1234. A router that only has the public key corresponding to K1 can only access Header 1 and Header 2. It does this by decrypting Header 2 using the public key corresponding to K1 to recover, for example, routing information in the header.

If a node has the key corresponding to K123, for example, it has access only to the first four headers of the packet, but not to the payload. The selection of keys can be done in a hierarchical manner, by the communication endpoints, such that their generation and transfer overhead are minimized. Methods of key generation, including hierarchical key generation, are known to those of ordinary skill in the art.

Key Distribution. FIG. 2 is a diagram illustrative of key distribution in a communication network 200 consistent with certain aspects of the invention. Referring to FIG. 2, each source node S has a unique private and public key pair (Kpr, Kpu), along with a public key certificate signed by a globally trusted entity. The public key certificate contains the identities of the trusted entity and of S, the validity interval of the certificate and the public key Kpu of S. The certificate also contains a hash of the previously mentioned fields, signed by the trusted entity.

The nodes have personalized access to packet headers and payload, as shown in FIG. 2. FIG. 2 shows an example of a network, with node S (202) as the source node and node D (204) as the destination node. Node S and D have two communication routes between them, one going through node A (206) and node B (208) and one only through node C (210). Nodes are labeled with their corresponding access rights (decryption keys) for the transmitted packets. For example, nodes S and D have keys L2, L3 and L4, allowing them maximum access to the transmitted packets. However, nodes A and C have only key L2, allowing them only to route packets.

Route Discovery. When the source node S (202) wants to send data to the destination node D (205), it first initiates a route discovery procedure. Route discovery procedures are well known in the art, and include reactive procedures such as Ad-hoc On-demand Distance Vector (AODV) routing or Dynamic Source Routing (DSR). FIG. 3 is a diagram illustrative of route discovery in a communication network consistent with certain aspects of the invention. In FIG. 3, the solid arrows denote RREQ messages and the broken arrows denote RREP messages. During the key discovery procedure, Node S distributes its public key certificate in a Route Request (RREQ) message. In FIG. 3, the RREG message 302 and 304 is sent to neighboring nodes 206 and 210. The RREQ message also contains other parameters (used for instance in AODV) such as route request ID that identifies the route request, a sequence number used to avoid the loops, time to live (TTL) and network size. Once authenticated, the public key Kpu can be used by any node in the network to send encrypted data to Node S.

The route request message RREQ is forwarded until it reaches the destination Node D. Node A adds its own address to the RREQ message and rebroadcasts it as RREQ message 306. Similarly, Node C adds its own address to the RREQ message and rebroadcasts it as RREQ message 308 to the destination node D and as RREQ message 310 to node D (312). Node B adds its own address to the RREQ message and rebroadcasts it as RREQ message 314 to the destination node D.

2. When Nodes A, B and C receive the RREQ message, they may return a Route Reply (RREP) message if they have a route to the destination in their data base. In this case, the source node may send out a credentials request (CREQ) message to the destination node along the discovered route. The destination node which will reply with credentials reply (CREP) message that is sent back to the source node via the discovered route. The CREP message, which is very similar to the RREP message, includes the trust list and the intermediate keys that are added en route. The exchange of message CREQ and CREP messages allows existing trust values to be updated. For instance, if the destination node modifies its trust list it can send a CREP to the source node. In a further embodiment, if a node receiving a RREQ message has a route to the destination in its data base, the RREQ message may be forwarded along the route as a unicast massage to the destination node. This approach reduces the amount of messaging required.

3. When the destination Node D receives the RREQ message, it responds with a route reply (RREP) message containing its public key certificate and a list containing a mapping between each intermediate node (A, B and C) and a trust level (or access rights). The list may be encrypted with the public key provided by source node S and signed with the private key of the destination node D. Note that the destination node D can receive multiple RREQ messages (308 and 314 in FIG. 3) initiated by the source node S, each bearing the same route request ID, though along different routes (i.e. going through different intermediate nodes). For each such message, the destination node D generates an RREP message as previously described. Thus node D responds to RREQ message 314 with RREP message 316 and to RREQ message 308 with RREP message 318.

4. When an intermediate node receives a RREP message it adds its own public key certificate before sending it to its predecessor in the route. Optionally, it can encrypt its rights with the public key of the source node S. The intermediate node updates its data base with the route ID, the next hop neighbor in the route (the node from it received RREP) and the final destination node for that route. A procedure that avoids route loops can also be implemented based on the sequence number of RREQ. In FIG. 3, node B (208) receives RREP message 316, adds its own public key certificate and transmits the RREP message 320 to node A (206). Node A receives RREP message 320, adds its own public key certificate and transmits the RREP message 322 to node S. Similarly, node C (208) receives RREP message 308, adds its own public key certificate and transmits the RREP message 324 to node S (202).

5. When the RREP reaches the source node S, it will contain the public key certificates of all the intermediate nodes (including the destination node), as well as the destination node's list of trust levels/access rights of intermediate nodes. This allows the source node to collect the identities of the intermediate routers on the discovered routes. The source node S verifies the validity of the certificates of the destination node D and all the intermediate nodes. This process allows the source node and the destination node to authenticate with each other, and allows the intermediate routers to authenticate to the source and destination node.

6. For each intermediate node, I, the source node S computes an intersection between the access rights of I in the source node's view and the access rights of I in the destination node's view. For example, if Node A is allowed to access headers 1 through 4 in the source node's view but only headers 1 through 3 in the destination node's view, it will only be allowed to access headers 1 through 3 during the communication session between S and D. If, for a given route between S and D, there exists an intermediate node I who's previously generated access rights are null, S drops the route. If no route exists between S and D with enough access rights, no communication can safely take place between them. If multiple routes with enough access rights exist between S and D, node S selects the one with the most trusted weakest intermediate router. The route is selected because it has the highest aggregate trust level.

7. The source node S then generates new encryption keys, K1, K12, K123 and K1234. For each intermediate node I, based on I's access rights, it selects the appropriate key, as described in step 6, encrypts it with the public key of I and signs it with the source node's private key. It then sends the results to each intermediate node that in turn verifies the source node's signature and reveals it access key.

Data Routing. During routing, each intermediate node can access fields of packets as decided by the communication endpoints (Nodes S and D). If the trust level of an intermediate node is reduced during the protocol, due to failure to route or other malicious behavior, the endpoints can decide to revoke the encryption keys, and repeat the route discovery and key distribution protocol, so that the aggregate trust levels are updated and new keys are redistributed to the intermediate nodes. However, if the rating of a node increases, because of cooperative behavior for example, the endpoints can send the node a new, higher level encryption key. For example, if Node A has key K12 but its trust level increases significantly, Nodes S and D can send it key K123, allowing it to access also the content of Header 4 in FIG. 1.

Protocol Extensions the route discovery phases of existing routing protocols (AODV, DSR) may be extended with two message types. The two new messages are used to implement the key distribution phase efficiently.

The first extension is a Screening Policy Preference KEY_REQUEST message. The fields for this message may include:

Key Usage ID. This field is an identifier that specifies the security procedure for which the key requested is required. This could be encryption or authentication of a message at the TCP/IP stack layer or other security protection mechanisms. For instance (using the example introduced in Figure) if the sender needs to have access to IP headers of an otherwise encrypted packet, the sender indicates that is needs L3 level decryption keys.

Sender ID. This field is an identifier that specifies the identities of the sender.

Receiver ID. This field is an identifier that specifies the identity of the traffic source (node S (202) in FIG. 2).

Public Key of Sender. This field specifies the public key of the sender of the KEY_REQUEST message, and may comprise a certificate.

The second extension is a Screening Policy Preference KEY_RESPONSE message. This message is sent by an intermediate node (nodes C, D or E in FIG. 2) and contains the security policy preference of the sender of this message. For example, the sender states that it needs to be able to access IP headers. The fields for this message may include:

Trust Level. This field specifies the trust level granted to the target of encryption.

Security Key. This field specifies the key granted for usage, corresponding with the content of the Trust Level field. This key is encrypted and sent with the public key of the recipient of the message carrying this extension (sender of the KEY_REQUEST message) and is signed by the sender.

FIG. 4 is a flow chart of a method for secure communication consistent with certain embodiments of the invention. Following start block 402 in FIG. 4, a source node wishing to communicate with a destination node broadcasts a RREQ message on the network at block 404. Each intermediate node receiving the REEQ message adds its own address to the message and forwards it at block 406. This process is repeated and one or more RREQ messages arrive at the destination node if a route exists. At block 408 the destination node transmits a RREP message to the network. The RREP message contains the message and a list of trust levels (in the view of the destination node) and is routed back to the source using the intermediate node addresses in the RREQ message. As each intermediate node receives the RREP message, it adds its own certificate and forwards the message towards the source at block 410. At block 412, the source node receives the RREP message and, using the list of trust levels from the destination node and its own list of trust levels, selects the most trusted route to the destination node. The most trusted route may be selected by computing the aggregate trust levels of the intermediate routers. The aggregate trust level may be, for example, the minimum value of the trust levels of the intermediate router assessed by the source node and the destination node. At block 414, the source node distributes keys to the intermediate node on the most trusted route. These keys will allow the intermediate nodes access selected parts of the communication packet. At block 416, the source node performs a hierarchical encryption of the communication packet according to the trust levels of the intermediate nodes and, at block 418, transmits this packet to the destination node along the most trusted route. The process terminates at block 420.

Any node may maintain a list of trust levels of connected nodes. These trust levels may be updated according to the behavior the nodes.

In one embodiment, X509 public key certificates are generated and used with public and secret key encryption protocols on hx4700 and MPX communicating devices, both running Pocket PC. The nodes are set up to work in wireless ad-hoc mode. The method may be implement using code (such as C#, Compact Framework). The protocol may be included in ad-hoc routing protocol, such as AODV or DSR, known to those of ordinary skill in the art.

The protocol allows mobile devices to communicate securely, while disclosing only information deemed to be necessary to third parties acting as routers.

Very little user interaction is required. Based on locally maintained blacklists, devices can automatically compute trust levels of intermediate routers, generate encryption keys, distribute keys and separately encrypt/decrypt the fields of communication packets.

The present invention, as described in embodiments herein, is implemented using a programmed processor of a network device executing programming instructions that control the network device to operate as broadly described above in flow chart form. The programming instructions can be stored on any suitable electronic storage medium. However, those skilled in the art will appreciate that the processes described above can be implemented in any number of variations and in many suitable programming languages without departing from the present invention. For example, the order of certain operations carried out can often be varied, additional operations can be added or operations can be deleted without departing from the invention. Error trapping can be added and/or enhanced and variations can be made without departing from the present invention. Such variations are contemplated and considered equivalent.

Those skilled in the art will appreciate that the program steps and associated data used to implement the embodiments described above can be implemented using disc storage as well as other forms of computer readable media, such as, for example, Read Only Memory (ROM) devices, Random Access Memory (RAM) devices, optical storage elements, magnetic storage elements, magneto-optical storage elements, flash memory and/or other equivalent storage technologies without departing from the present invention. Such alternative storage devices should be considered equivalents.

While the invention has been described in conjunction with specific embodiments, it is evident that many alternatives, modifications, permutations and variations will become apparent to those of ordinary skill in the art in light of the foregoing description. Accordingly, it is intended that the present invention embrace all such alternatives, modifications and variations as fall within the scope of the appended claims.

The Abstract of the Disclosure is provided to allow the reader to quickly ascertain the nature of the technical disclosure. It is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims. In addition, in the foregoing Detailed Description, it can be seen that various features are grouped together in various embodiments for the purpose of streamlining the disclosure. This method of disclosure is not to be interpreted as reflecting an intention that the claimed embodiments require more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive subject matter lies in less than all features of a single disclosed embodiment. Thus the following claims are hereby incorporated into the Detailed Description, with each claim standing on its own as a separately claimed subject matter. 

1. A method for providing communication nodes, acting as intermediate routers for communication packets transmitted between a source node and a destination node, with different access rights to the fields of the routed communication packets, the method comprising: discovering routes of intermediate routers between the source node and the destination node; collecting the identities of the intermediate routers on the discovered routes; computing the aggregate trust levels of the intermediate routers; selecting a most trusted route of the discovered routes; computing, and securely distributing, encryption keys to intermediate routers on the most trusted route based on the trust level of the intermediate routers; and encrypting fields of the communication packets with corresponding encryption keys.
 2. A method in accordance with claim 1, further comprising the source node and the destination node authenticating with each other.
 3. A method in accordance with claim 2, further comprising authenticating the intermediate routers to the source and destination nodes.
 4. A method in accordance with claim 2, wherein the source node and the destination node authenticating with each other, comprising sending messages containing public key certificates of the corresponding device.
 5. A method in accordance with claim 1, further comprising redistributing encryption keys based on behavior of the intermediate routers.
 6. A method in accordance with claim 1, wherein collecting identities of intermediate routers on the routes comprises adding public key certificates of the intermediate routers to messages sent from the intermediate routers.
 7. A method in accordance with claim 1, wherein computing the aggregate trust levels of the intermediate routers comprises taking the minimum value of the trust levels of the intermediate router assessed by the source node and the destination node.
 8. A method in accordance with claim 1, wherein selecting the most trusted route of the discovered routes comprises the source node selecting among all the discovered routes the route with the most trusted weakest intermediate router.
 9. A method in accordance with claim 1, further comprising the source node generating encryption keys for each field of the communication packets.
 10. A method in accordance with claim 1, wherein securely distributing encryption keys to intermediate routers on the most trusted route comprises the source node encrypting the key with a public key of the intermediate router and signing the encrypted key with the private key of the source node.
 11. A method in accordance with claim 1, wherein computing encryption keys is performed by the source node.
 12. A method in accordance with claim 1, further comprising: detecting malicious behavior of intermediate routers; and if malicious behavior is detected in a intermediate router: reducing the trust level of the intermediate router; updating the aggregate trust levels of the intermediate routers; selecting a new most trusted route of the discovered routes; and distributing new encryption keys to the intermediate routers on the new most trusted route in accordance with the reduced trust level of the intermediate router.
 13. A method in accordance with claim 1, further comprising: detecting cooperative behavior of intermediate routers; and if cooperative behavior is detected in a intermediate router: increasing the trust level of the intermediate router; updating the aggregate trust levels of the intermediate routers; selecting a new most trusted route of the discovered routes; and distributing new encryption keys to the intermediate routers on the new most trusted route in accordance with the increased trust level of the intermediate router.
 14. A method in accordance with claim 1, wherein securely distributing the encryption keys comprises providing a different number of encryption keys to the intermediate routers on the most trusted route based on the trust level of the intermediate routers.
 15. A method in accordance with claim 14, wherein the fields of each communication packet comprises a plurality of headers in addition to a data payload, and encrypting fields of the communication packets comprises encrypting each header using a different encryption key and encrypting the data payload using an encryption key that is different from the encryption key used for encrypting any of the headers.
 16. A communication exchange between an intermediate router and a source node of an ad-hoc network for distributing keys from the source node, the communication exchange comprising: a KEY_REQUEST message for transmission from the intermediate router to the source node, the KEY_REQUEST message comprising: a Key Usage identifier specifying a security procedure for which a key request is made; an identifier of the intermediate router; an identifier of the source node; and a public key of the intermediate router; and a KEY_RESPONSE message for transmission from the source node to the intermediate router in response to the KEY_REQUEST message, the KEY_RESPONSE message comprising: a Trust Level specifying a trust level granted to the intermediate router by the source node; and a security key corresponding to and in a different field from the Trust Level. 